منابع مشابه
Improving Runtime Overheads for detectEr
Runtime Verification (RV) [11] is a lightweight verification technique mitigating the scalability issues associated with exhaustive verification techniques such as model checking. Low overheads are an important requirement for the viability of any RV framework, where the additional computation introduced by the monitors should ideally be kept to a minimum. detectEr[3, 7] is an RV tool for analy...
متن کاملManaging Compilation Overheads in a Runtime Specializer for OpenMP
While runtime compilation has in practice been largely restricted to programming languages that execute on virtual machines, such as Java and C#, parallel OpenMP programs show many promising traits for efficient and effective runtime optimization. The stOMP system for the runtime optimization of OpenMP applications is currently under development at the University of Toronto. One of the key issu...
متن کاملWhere Have all the Cycles Gone? - Investigating Runtime Overheads of OSAssisted Replication
In order to allow user-level applications tolerate transient hardware faults, we developed Romain, an operating system service that transparently replicates unmodified binary applications. While replication increases overall system reliability, it also requires additional resources and runtime. In this paper we evaluate Romain’s runtime overhead using the SPEC INT 2006 benchmark suite. With mos...
متن کاملReducing the Network Overheads of .NET Remoting through Runtime Call Aggregation
Modern application frameworks such as the Common Language Infrastructure (the core technology behind .NET) and Java are designed with sophisticated remoting capabilities at their core. This allows programmers to quickly and easily produce distributed applications using standard object-oriented techniques. Although this is largely beneficial, most object-oriented APIs are not well suited to remo...
متن کاملImproving cache performance by runtime data movement
The performance of a recursive data structure (RDS) increasingly depends on good data cache behaviour, which may be improved by software/hardware prefetching or by ensuring that the RDS has a good data layout. The latter is harder but more effective, and requires solving two separate problems: firstly ensuring that new RDS nodes are allocated in a good location in memory, and secondly preventin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.178.1